Graphs with large girth are b-continuous
نویسندگان
چکیده
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of G is the maximum integer b(G) for which G has a b-coloring with b(G) colors. A graph G is b-continuous if G has a b-coloring with k colors, for every integer k in the interval [χ(G), b(G)]. It is known that not all graphs are b-continuous. In this article, we show that if G has girth at least 10, then G is b-continuous.
منابع مشابه
On reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملThe second eigenvalue of regular graphs of given girth
Lower bounds on the subdominant eigenvalue of regular graphs of given girth are derived. Our approach is to approximate the discrete spectrum of a finite regular graph by the continuous spectrum of an infinite regular tree. We interpret these spectra as probability distributions and the girth condition as equalities between the moments of these distributions. Then the associated orthogonal poly...
متن کاملNon-Hamiltonian 3–Regular Graphs with Arbitrary Girth
It is well known that 3–regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3–regular graphs without reducing the girth, thereby proving that such graphs with arbitrarily large girth also exist. The resulting graphs can be 1–, 2– or 3–edge-connected depending on the construction chosen. From the constructions arise (nai...
متن کاملHigh-Girth Graphs Avoiding a Minor are Nearly Bipartite
Let H be a xed graph. We show that any H-minor free graph of high enough girth has a circular-chromatic number arbitrarily close to two. Equivalently, such graphs have homomorphisms into a large odd circuit. In particular, graphs of high girth and of bounded genus or bounded tree width are \nearly bipartite" in this sense. For example, any planar graph of girth at least 16 admits a homomorphism...
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 55 شماره
صفحات -
تاریخ انتشار 2016